#define _CRT_SECURE_NO_WARNINGS

#include "BinarySearchTree.h"

int main()
{
	vector<int> v = { 8, 3, 1, 10, 6, 4, 7, 14, 13 };
	BSTree<int> root;
	for (auto e : v)
	{
		root.Insert(e);
	}
	root.InOrder();
	//for (int i = 1; i < 15; i++)
	//{
	//	cout << root.Find(i) << ' ';
	//}
	//cout << endl;
	for (int i = 1; i < 15; i++)
	{
		root.Erase(i);
		root.InOrder();
	}



	return 0;
}
